689 research outputs found
Coverage and Rate Analysis for Unmanned Aerial Vehicle Base Stations with LoS/NLoS Propagation
The use of unmanned aerial vehicle base stations (UAV-BSs) as airborne base
stations has recently gained great attention. In this paper, we model a network
of UAV-BSs as a Poisson point process (PPP) operating at a certain altitude
above the ground users. We adopt an air-to-ground (A2G) channel model that
incorporates line-of-sight (LoS) and non-line-of-sight (NLoS) propagation.
Thus, UAV-BSs can be decomposed into two independent inhomogeneous PPPs. Under
the assumption that NLoS and LoS channels experience Rayleigh and Nakagami-m
fading, respectively, we derive approximations for the coverage probability and
average achievable rate, and show that these approximations match the
simulations with negligible errors. Numerical simulations have shown that the
coverage probability and average achievable rate decrease as the height of the
UAV-BSs increases
HetHetNets: Heterogeneous Traffic Distribution in Heterogeneous Wireless Cellular Networks
A recent approach in modeling and analysis of the supply and demand in
heterogeneous wireless cellular networks has been the use of two independent
Poisson point processes (PPPs) for the locations of base stations (BSs) and
user equipments (UEs). This popular approach has two major shortcomings. First,
although the PPP model may be a fitting one for the BS locations, it is less
adequate for the UE locations mainly due to the fact that the model is not
adjustable (tunable) to represent the severity of the heterogeneity
(non-uniformity) in the UE locations. Besides, the independence assumption
between the two PPPs does not capture the often-observed correlation between
the UE and BS locations.
This paper presents a novel heterogeneous spatial traffic modeling which
allows statistical adjustment. Simple and non-parameterized, yet sufficiently
accurate, measures for capturing the traffic characteristics in space are
introduced. Only two statistical parameters related to the UE distribution,
namely, the coefficient of variation (the normalized second-moment), of an
appropriately defined inter-UE distance measure, and correlation coefficient
(the normalized cross-moment) between UE and BS locations, are adjusted to
control the degree of heterogeneity and the bias towards the BS locations,
respectively. This model is used in heterogeneous wireless cellular networks
(HetNets) to demonstrate the impact of heterogeneous and BS-correlated traffic
on the network performance. This network is called HetHetNet since it has two
types of heterogeneity: heterogeneity in the infrastructure (supply), and
heterogeneity in the spatial traffic distribution (demand).Comment: JSA
Throughput-based Design for Polar Coded-Modulation
Typically, forward error correction (FEC) codes are designed based on the
minimization of the error rate for a given code rate. However, for applications
that incorporate hybrid automatic repeat request (HARQ) protocol and adaptive
modulation and coding, the throughput is a more important performance metric
than the error rate. Polar codes, a new class of FEC codes with simple rate
matching, can be optimized efficiently for maximization of the throughput. In
this paper, we aim to design HARQ schemes using multilevel polar
coded-modulation (MLPCM). Thus, we first develop a method to determine a
set-partitioning based bit-to-symbol mapping for high order QAM constellations.
We simplify the LLR estimation of set-partitioned QAM constellations for a
multistage decoder, and we introduce a set of algorithms to design
throughput-maximizing MLPCM for the successive cancellation decoding (SCD).
These codes are specifically useful for non-combining (NC) and Chase-combining
(CC) HARQ protocols. Furthermore, since optimized codes for SCD are not optimal
for SC list decoders (SCLD), we propose a rate matching algorithm to find the
best rate for SCLD while using the polar codes optimized for SCD. The resulting
codes provide throughput close to the capacity with low decoding complexity
when used with NC or CC HARQ
Erlang analysis of cellular networks using stochastic Petri nets and user-in-the-loop extension for demand control
Abstract—Cellular networks face severe challenges due to the expected growth of application data rate demand with an increase rate of 100 % per year. Over-provisioning capacity has been the standard approach to reduce the risk of overload situations. Traditionally in telephony networks, call blocking and overload probability have been analyzed using the Erlang-B and Erlang-C formulas, which model limited capacity communication systems without or with session request buffers, respectively. While a closed-form expression exists for the blocking probability for constant load and service, a steady-state Markov chain (MC) analysis can always provide more detailed data, as long as the Markov property of the arrival and service processes hold. However, there is a significant modeling advantage by using the stochastic Petri net (SPN) paradigm to model the details of such a system. In addition, software tool support allows getting numeric analysis results quickly by solving the state probabilities in the background and without the need to run any simulation. Because of this efficiency, the equivalent SPN model of the Engset, Erlang-B and Erlang-C situation is introduced as novelty in this paper. Going beyond the original Erlang scenario, the user-in-the-loop (UIL) approach of demand shaping by closed-loop control is studied as an extension. In UIL, demand control is implemented by a dynamic usage-based tariff which motivates users to reduce or postpone the use of applications on their smart phone in times of light to severe congestion. In this paper, the effect of load on the price and demand reduction is modeled with an SPN based on the classical Erlang Markov chain structure. Numeric results are easily obtained and presented in this paper, including probability density functions (PDF) of the load situation, and a parameter analysis showing the effectiveness of UIL to reduce the overload probability. Keywords—User-in-the-loop (UIL); demand shaping; demand control; congestion; Erlang; stochastic Petri-net (SPN). I
Transmission Scheme, Detection and Power Allocation for Uplink User Cooperation with NOMA and RSMA
In this paper, we propose two novel
cooperative-non-orthogonal-multiple-access (C-NOMA) and
cooperative-rate-splitting-multiple-access (C-RSMA) schemes for uplink user
cooperation. At the first mini-slot of these schemes, each user transmits its
signal and receives the transmitted signal of the other user in full-duplex
mode, and at the second mini-slot, each user relays the other user's message
with amplify-and-forward (AF) protocol. At both schemes, to achieve better
spectral efficiency, users transmit signals in the non-orthogonal mode in both
mini-slots. In C-RSMA, we also apply the rate-splitting method in which the
message of each user is divided into two streams. In the proposed detection
schemes for C-NOMA and C-RSMA, we apply a combination of
maximum-ratio-combining (MRC) and successive-interference-cancellation (SIC).
Then, we derive the achievable rates for C-NOMA and C-RSMA, and formulate two
optimization problems to maximize the minimum rate of two users by considering
the proportional fairness coefficient. We propose two power allocation
algorithms based on successive-convex-approximation (SCA) and
geometric-programming (GP) to solve these non-convex problems. Next, we derive
the asymptotic outage probability of the proposed C-NOMA and C-RSMA schemes,
and prove that they achieve diversity order of two. Finally, the
above-mentioned performance is confirmed by simulations.Comment: 32 pages, 13 figure
- …